Sweeping graphs with large clique number

AbstractSearching a network for intruders is an interesting and often difficult problem. Sweeping (or edge searching) is one such search model, in which intruders may exist anywhere along an edge. It was conjectured that graphs exist for which the connected sweep number is strictly less than the monotonic connected sweep number. We prove that this is true, and the difference can be arbitrarily large. We also show that the clique number is a lower bound on the sweep number

The Gravitational-wave Optical Transient Observer (GOTO)

The Gravitational-wave Optical Transient Observer (GOTO) is a wide-field telescope project focused on detecting optical counterparts to gravitational-wave sources. Each GOTO robotic mount holds eight 40 cm telescopes, giving an overall field of view of 40 square degrees. As of 2022 the first two GOTO mounts have been commissioned at the Roque de los Muchachos Observatory on La Palma, Canary Islands, and construction of the second node with two additional 8-telescope mounts has begin at Siding Spring Observatory in New South Wales, Australia. Once fully operational each GOTO mount will be networked to form a robotic, multi-site observatory, which will survey the entire visible sky every two nights and enable rapid follow-up detections of transient sources

Making Memorial Student-Ready: Reflections on the First Year Success Experience

In eleven short chapters faculty, academic advising staff and student union representatives discuss aspects of Memorial’s First Year Success Program (piloted as a Teaching Learning Framework initiative 2012-2017). Teaching approaches, curriculum content and policy rationales are covered in a broad view of how and why students identified as least likely to succeed at university can be academically supported. Contributors identify the singular importance of the community that First Year Success provided them and its student participants

Constructing the Spectrum of Packings and Coverings for the Complete Graph with Stars with up to Five Edges

The packing and covering problems have been considered for several classes of graphs. For instance, Bryant et. al. have investigated the packing problem for paths and cycles, and the packing and covering problems for 3-cubes. The packing and covering problems were settled for stars with up to six edges by Roditty. In this paper, for every possible leave graph (excess graph), we find a corresponding maximum packing (minimum covering) of the complete graph with stars with up to five edges

Mini-presentations: Setting up instructor-training courses

What are the key challenges in setting up and maintaining a dedicated instructor-training course Three senior faculty members respond. Danny Dyer, Brian Forrest, Costanza PiccoloNon UBCUnreviewedAuthor affiliation: Memorial University of NewfoundlandFacult